How to improve a random number generator
نویسنده
چکیده
It is demonstrated that the one-dimensional random walk is sensitive both to short and long correlation of random numbers. In the case of correlated random numbers, the walker is trapped in the vicinity of the correlation. The result is a multipeak range distribution of the walker. Hence, the one-dimensional random walk can be used as a supplement to the standard tests for revealing long correlations of the generated random numbers. By implementing variety of tests to several generators we have shown that the quality can be improved by using a double randomization technique only if the random numbers, to be sampled from, are of a good quality. The sampling generator is less important. We propose, as well, a generator that produces high-quality random numbers for many stochastic processes. 2000 Elsevier Science B.V. All rights reserved. PACS: 02.50 Ng; 02.70 Lg; 05.40
منابع مشابه
True Random Number Generators Secure in a Changing Environment: Improved Security Bounds
Barak, Shaltiel Tromer showed how to construct a True Random Number Generator (TRNG) which is secure against an adversary who has some limited control over the environment. In this paper we improve the security analysis of this TRNG. Essentially, we significantly reduce the entropy loss and running time needed to obtain a required level of security and robustness. Our approach is based on repla...
متن کاملTesting the Tests: Using Random Number Generators to Improve Empirical Tests
The implementer of an empirical test for random number generators is faced with some difficult problems, especially if the test is based on a statistic which is known only approximately: How can the test be tested? How can the approximation be improved? When is it good enough? A number of principles can be applied to these problems. These principles are illustrated using implementations of the ...
متن کاملHow to Recycle Random Bits
We show that modified versions of the linear congruential generator and the shift register generator are provably good for amplifying the correctness of a probabilistic algorithm. More precisely, if r random bits are needed for a BPP algorithm to be correct with probability at least 2/3, then O(r + k) bits are needed to improve this probability to 1 − 2−k. We also present a different pseudo-ran...
متن کاملAn improvement of a cryptanalysis algorithm
In this paper we present experiments in order to show how some pseudo random number generators can improve the effectiveness of a statistical cryptanalysis algorithm. We deduce mainly that a better generator enhance the accuracy of the cryptanalysis algorithm.
متن کاملAn optimization technique on pseudorandom generators based on chaotic iterations
Internet communication systems involving cryptography and data hiding often require billions of random numbers. In addition to the speed of the algorithm, the quality of the pseudo-random number generator and the ease of its implementation are common practical aspects. In this work we will discuss how to improve the quality of random numbers independently from their generation algorithm. We pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998